An Optimistic NBAC-Based Fair Exchange Method for Arbitrary Items
Identifieur interne : 000956 ( Main/Exploration ); précédent : 000955; suivant : 000957An Optimistic NBAC-Based Fair Exchange Method for Arbitrary Items
Auteurs : Masayuki Terada [Japon] ; Kensaku Mori [Japon] ; Sadayuki Hongo [Japon]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2006.
English descriptors
- Teeft :
- Agreement property, Algorithm, Arbitrary items, Communication channel, Communication channels, Congestion problem, Current smartcards, Digital content, Digital signature, Electronic commerce, Electronic vouchers, Exchange method, Exchange protocol, Exchange protocols, Fair exchange, Fair exchange method, Fair exchange problem, Fair exchange protocols, Gradual protocols, Hongo, Main protocol, Mobile phone, Mobile phones, Mori, Mutual exchange, Nbac, Nbac problem, Nbac properties, Nbac protocol, Nbac protocols, Online, Optimistic manner, Optimistic nbac protocol, Optimistic protocol, Optimistic protocols, Other party, Output resulta, Proc, Protocol, Reduction algorithm, Resulta, Resultb, Resultt, Sect, Smartcard, Smartcards, Strong generatability, Subprotocol, System model, Terada, Termination property, Untrusted, Untrusted process, Untrusted processes, Votea, Voucher, Weak fairness.
Abstract
Abstract: Fair exchange protocols are important in realizing safe electronic commerce. In particular, optimistic fair exchange protocols, which involve a trusted third party only when mutual communication between exchanging parties fails, are the most promising development because of their efficiency. Unfortunately, however, existing optimistic protocols place restrictions on the items that can be exchanged, i.e., at least one item must be a “strongly generatable” item such as a digital signature. Without this requirement, only weak fairness that requires (expensive) external dispute resolution processes (e.g. trials in court) after exchange failure can be assured. This paper proposes a novel fair exchange method that enables parties to fairly exchange arbitrary items in an optimistic manner. This is achieved by realizing an optimistic non-blocking atomic commitment (NBAC) protocol between two smartcards and adapting the known result that fair exchange can be reduced to NBAC among trusted processes.
Url:
DOI: 10.1007/11733447_8
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000382
- to stream Istex, to step Curation: 000360
- to stream Istex, to step Checkpoint: 000759
- to stream Main, to step Merge: 000956
- to stream Main, to step Curation: 000956
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">An Optimistic NBAC-Based Fair Exchange Method for Arbitrary Items</title><author><name sortKey="Terada, Masayuki" sort="Terada, Masayuki" uniqKey="Terada M" first="Masayuki" last="Terada">Masayuki Terada</name></author><author><name sortKey="Mori, Kensaku" sort="Mori, Kensaku" uniqKey="Mori K" first="Kensaku" last="Mori">Kensaku Mori</name></author><author><name sortKey="Hongo, Sadayuki" sort="Hongo, Sadayuki" uniqKey="Hongo S" first="Sadayuki" last="Hongo">Sadayuki Hongo</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:255EA3FE260363CB0C8335D678CD1E7A8552B2BC</idno><date when="2006" year="2006">2006</date><idno type="doi">10.1007/11733447_8</idno><idno type="url">https://api.istex.fr/document/255EA3FE260363CB0C8335D678CD1E7A8552B2BC/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000382</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000382</idno><idno type="wicri:Area/Istex/Curation">000360</idno><idno type="wicri:Area/Istex/Checkpoint">000759</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000759</idno><idno type="wicri:doubleKey">0302-9743:2006:Terada M:an:optimistic:nbac</idno><idno type="wicri:Area/Main/Merge">000956</idno><idno type="wicri:Area/Main/Curation">000956</idno><idno type="wicri:Area/Main/Exploration">000956</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">An Optimistic NBAC-Based Fair Exchange Method for Arbitrary Items</title><author><name sortKey="Terada, Masayuki" sort="Terada, Masayuki" uniqKey="Terada M" first="Masayuki" last="Terada">Masayuki Terada</name><affiliation wicri:level="1"><country xml:lang="fr">Japon</country><wicri:regionArea>NTT DoCoMo, Inc., 3–5 Hikari-no-oka, Yokosuka, Kanagawa</wicri:regionArea><wicri:noRegion>Kanagawa</wicri:noRegion></affiliation></author><author><name sortKey="Mori, Kensaku" sort="Mori, Kensaku" uniqKey="Mori K" first="Kensaku" last="Mori">Kensaku Mori</name><affiliation wicri:level="1"><country xml:lang="fr">Japon</country><wicri:regionArea>NTT DoCoMo, Inc., 3–5 Hikari-no-oka, Yokosuka, Kanagawa</wicri:regionArea><wicri:noRegion>Kanagawa</wicri:noRegion></affiliation></author><author><name sortKey="Hongo, Sadayuki" sort="Hongo, Sadayuki" uniqKey="Hongo S" first="Sadayuki" last="Hongo">Sadayuki Hongo</name><affiliation wicri:level="1"><country xml:lang="fr">Japon</country><wicri:regionArea>NTT DoCoMo, Inc., 3–5 Hikari-no-oka, Yokosuka, Kanagawa</wicri:regionArea><wicri:noRegion>Kanagawa</wicri:noRegion></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2006</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="Teeft" xml:lang="en"><term>Agreement property</term><term>Algorithm</term><term>Arbitrary items</term><term>Communication channel</term><term>Communication channels</term><term>Congestion problem</term><term>Current smartcards</term><term>Digital content</term><term>Digital signature</term><term>Electronic commerce</term><term>Electronic vouchers</term><term>Exchange method</term><term>Exchange protocol</term><term>Exchange protocols</term><term>Fair exchange</term><term>Fair exchange method</term><term>Fair exchange problem</term><term>Fair exchange protocols</term><term>Gradual protocols</term><term>Hongo</term><term>Main protocol</term><term>Mobile phone</term><term>Mobile phones</term><term>Mori</term><term>Mutual exchange</term><term>Nbac</term><term>Nbac problem</term><term>Nbac properties</term><term>Nbac protocol</term><term>Nbac protocols</term><term>Online</term><term>Optimistic manner</term><term>Optimistic nbac protocol</term><term>Optimistic protocol</term><term>Optimistic protocols</term><term>Other party</term><term>Output resulta</term><term>Proc</term><term>Protocol</term><term>Reduction algorithm</term><term>Resulta</term><term>Resultb</term><term>Resultt</term><term>Sect</term><term>Smartcard</term><term>Smartcards</term><term>Strong generatability</term><term>Subprotocol</term><term>System model</term><term>Terada</term><term>Termination property</term><term>Untrusted</term><term>Untrusted process</term><term>Untrusted processes</term><term>Votea</term><term>Voucher</term><term>Weak fairness</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Fair exchange protocols are important in realizing safe electronic commerce. In particular, optimistic fair exchange protocols, which involve a trusted third party only when mutual communication between exchanging parties fails, are the most promising development because of their efficiency. Unfortunately, however, existing optimistic protocols place restrictions on the items that can be exchanged, i.e., at least one item must be a “strongly generatable” item such as a digital signature. Without this requirement, only weak fairness that requires (expensive) external dispute resolution processes (e.g. trials in court) after exchange failure can be assured. This paper proposes a novel fair exchange method that enables parties to fairly exchange arbitrary items in an optimistic manner. This is achieved by realizing an optimistic non-blocking atomic commitment (NBAC) protocol between two smartcards and adapting the known result that fair exchange can be reduced to NBAC among trusted processes.</div></front></TEI><affiliations><list><country><li>Japon</li></country></list><tree><country name="Japon"><noRegion><name sortKey="Terada, Masayuki" sort="Terada, Masayuki" uniqKey="Terada M" first="Masayuki" last="Terada">Masayuki Terada</name></noRegion><name sortKey="Hongo, Sadayuki" sort="Hongo, Sadayuki" uniqKey="Hongo S" first="Sadayuki" last="Hongo">Sadayuki Hongo</name><name sortKey="Mori, Kensaku" sort="Mori, Kensaku" uniqKey="Mori K" first="Kensaku" last="Mori">Kensaku Mori</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Sarre/explor/MusicSarreV3/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000956 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000956 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Sarre
|area= MusicSarreV3
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:255EA3FE260363CB0C8335D678CD1E7A8552B2BC
|texte= An Optimistic NBAC-Based Fair Exchange Method for Arbitrary Items
}}
| This area was generated with Dilib version V0.6.33. |  |